Stochastic Consensus Algorithms over General Noisy Networks
نویسندگان
چکیده
منابع مشابه
Stochastic consensus over noisy networks with Markovian and arbitrary switches
This paper considers stochastic consensus problems over lossy wireless networks. We first propose a measurement model with a random link gain, additive noise, and Markovian lossy signal reception, which captures uncertain operational conditions of practical networks. For consensus seeking, we apply stochastic approximation and derive a Markovian mode dependent recursive algorithm. Mean square a...
متن کاملConsensus - Type Stochastic Approximation Algorithms
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Autobiographical Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
متن کاملCoordination and Consensus of Networked Agents with Noisy Measurements: Stochastic Algorithms and Asymptotic Behavior
This paper considers the coordination and consensus of networked agents where each agent has noisy measurements of its neighbors’ states. For consensus seeking, we propose stochastic approximation type algorithms with a decreasing step size, and introduce the notions of mean square and strong consensus. Although the decreasing step size reduces the detrimental effect of the noise, it also reduc...
متن کاملConsensus dynamics over networks
Consensus dynamics is one of the most popular multi-agent dynamical systems. It shows up in socio-economic contexts as a model for consensus formation in a society of individuals. In the engineering world, it has been considered as a basic algorithm to be employed in networks of agents (sensors, vehicles, etc.) for efficient distributive computation of global functions. In this survey we review...
متن کاملOn Consensus Over Random Networks
We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random but independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SICE Journal of Control, Measurement, and System Integration
سال: 2020
ISSN: 1882-4889,1884-9970
DOI: 10.9746/jcmsi.13.274